A Quantum Interior Point Method for LPs and SDPs
نویسندگان
چکیده
منابع مشابه
Lagrangian Dual Interior - Point Methods for Sdps 3
This paper proposes a new predictor-corrector interior-point method for a class of semidefinite programs, which numerically traces the central trajectory in a space of Lagrange multipliers. The distinguished features of the method are full use of the BFGS quasi-Newton method in the corrector procedure, and an application of the conjugate gradient method with an effective preconditioning matrix ...
متن کاملAffine reductions for LPs and SDPs
We define a reduction mechanism for LP and SDP formulations that degrades approximation factors in a controlled fashion. Our reduction mechanism is a minor restriction of classical reductions establishing inapproximability in the context of PCP theorems. As a consequence we establish strong linear programming inapproximability (for LPs with a polynomial number of constraints) formany problems. ...
متن کاملInterior Point Method
All forms of the simplex method reach the optimum by traversing a series of basic solutions. Since each basic solution represents an extreme point of the feasible region, the track followed by the algorithm moves around the boundary of the feasible region. In the worst case, it may be necessary to examine most if not all of the extreme points. This can be cripplingly inefficient given that the ...
متن کاملAn Interior-point Method for Semideenite Programming an Interior-point Method for Semideenite Programming
We propose a new interior point based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semideenite matrices. We present a theoretical convergence analysis, and show that the approach is very eecient for graph bisection problems, such as max-cut. The approach can also be applied to max-min eigenvalue problems.
متن کاملLocal convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
An example of SDPs (semide nite programs) exhibits a substantial di culty in proving the superlinear convergence of a direct extension of the Mizuno-Todd-Ye type predictorcorrector primal-dual interior-point method for LPs (linear programs) to SDPs, and suggests that we need to force the generated sequence to converge to a solution tangentially to the central path (or trajectory). A Mizuno-Todd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Quantum Computing
سال: 2020
ISSN: 2643-6809,2643-6817
DOI: 10.1145/3406306